Enumerating Regular Mixed-Cell Configurations

نویسندگان

  • T. Michiels
  • Jan Verschelde
چکیده

By means of the Cayley Trick the problem of enumerating all regular ne mixed subdivisions is reduced to enumerating all regular triangulations. The set of all regular triangulations is well-understood thanks to the bijection with the vertices of the secondary polytope. However, since we are only interested in the conngurations of mixed cells in a mixed subdivision, we want to avoid dealing with other cells. We propose an operator derived from the bistellar ip for regular triangulations to modify a mixed-cell connguration.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumerating topological (nk)-configurations

An (nk)-configuration is a set of n points and n lines in the projective plane such that their point – line incidence graph is k-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are considered to be straight lines, pseudolines, or just combinatorial lines. We provide an algorithm for generating, for given n and k, all topological (nk)-configurati...

متن کامل

Regular triangulations and resultant polytopes

We describe properties of the Resultant polytope of a given set of polynomial equations towards an outputsensitive algorithm for enumerating its vertices. In principle, one has to consider all regular fine mixed subdivisions of the Minkowski sum of the Newton polytopes of the given equations. By the Cayley trick, this is equivalent to computing all regular triangulations of another point set in...

متن کامل

On the generation of topological (nk)-configurations

An (nk)-configuration is a set of n points and n lines in the projective plane such that the point – line incidence graph is k-regular. The configuration is geometric, topological, or combinatorial depending on whether lines are considered to be straight lines, pseudolines or just combinatorial lines. We provide an algorithm for generating all combinatorial (nk)-configurations that admit a topo...

متن کامل

Enumeration of the non-isomorphic configurations for a reconfigurable modular robot with square-cubic-cell modules

Configuration of a reconfigurable modular system is a tough issue because the possible configurations or structures grow exponentially with the number of modules. A library of the non‐isomorphic configurations should be set up as a database for configuration design and control. In this paper, we propose a matrix‐based enumerating approach for the non‐isomorphic configurati...

متن کامل

Geometrically constrained statistical systems on regular and random lattices: From folding to meanders

We review a number a recent advances in the study of two-dimensional statistical models with strong geometrical constraints. These include folding problems of regular and random lattices as well as the famous meander problem of enumerating the topologically inequivalent configurations of a meandering road crossing a straight river through a given number of bridges. All these problems turn out t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 21  شماره 

صفحات  -

تاریخ انتشار 1999